Shift Registers
نویسنده
چکیده
A homomorphism of the de Bruijn graph that maps a graph of order n onto one of order n -1 and its applications to the design of nonsingular feedback shift registers are discussed. The properties preserved under this mapping suggest a new design technique whose main advantage is due to the fact that the problem of designing a desired n-stage shift register may be reduced to a problem of order n -1 or less. Among the results obtained is a recursive formula for a feedback function that generates a cycle of maximum length.
منابع مشابه
Algebraic Feedback Shift Registers
A general framework for the design of feedback registers based on algebra over complete rings is described. These registers generalize linear feedback shift registers and feedback with carry shift registers. Basic properties of the output sequences are studied: relations to the algebra of the underlying ring; synthesis of the register from the sequence (which has implications for cryptanalysis)...
متن کاملRegister Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based on the algebra of π-adic numbers, where π is an element in a ring R, and produce sequences of elements in R/(π). We give several cases where the register synthesis problem can be solved by an efficient algorithm. Conseq...
متن کاملAlgebraic Feedback Shift Registers Based on Function Fields
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations of linear feedback shift registers. We describe conditions under which such AFSRs produce sequences with various ideal randomness properties. We also show that there is an efficient algorithm which, given a prefix of a s...
متن کاملA. Synthesis and Linearization of Nonlinear Feedback Shift Registers -basis of a Model of Memoryt Linear Shift Registers Have Been Extensively Studied since the Pioneering Work Of
Linear shift registers have been extensively studied since the pioneering work of D. A. Huffman. A general theory was created by Huffman, l Golomb, Elspas, Stern, Friedland, Zierler, Hartmannis, Massey, and others. This progress was mainly due to the identification of the operations performed by linear switching circuits with algebraic operations over Galois fields. There was no general theory ...
متن کاملAn asymptotic formula for the number of irreducible transformation shift registers
We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short proof for the exact number of irreducible transformation shift registers of order two using a recent generalization of a theorem of Carlitz.
متن کاملLarge Period Nearly deBruijn FCSR Sequences ( Extended
Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. Jn this paper we exhibit a tpchnique for easily fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006